Pluripotency without Max

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pluripotency without Proliferation

Mouse embryonic stem cells (mESCs) are capable of unlimited proliferation without losing pluripotency. Scognamiglio et al. now reveal that Myc depletion shifts mESCs into a dormant state reminiscent of embryonic diapause in which pluripotency remains fully preserved, thus decoupling pluripotency from proliferative programs.

متن کامل

Maintenance of pluripotency in mouse ES cells without Trp53

Tumor suppressor Trp53 works as a guardian of the genome in somatic cells. In mouse embryonic stem (ES) cells, it was reported that Trp53 represses pluripotency-associated transcription factor Nanog to induce differentiation. However, since Trp53-null mice develop to term, Trp53 is dispensable for both the maintenance and differentiation of the pluripotent stem cell population in vivo, suggesti...

متن کامل

Neural Stem Cells Achieve and Maintain Pluripotency without Feeder Cells

BACKGROUND Differentiated cells can be reprogrammed into pluripotency by transduction of four defined transcription factors. Induced pluripotent stem cells (iPS cells) are expected to be useful for regenerative medicine as well as basic research. Recently, the report showed that mouse embryonic fibroblasts (MEF) cells are not essential for reprogramming. However, in using fibroblasts as donor c...

متن کامل

Induction of Pluripotency in Adult Equine Fibroblasts without c-MYC

Despite tremendous efforts on isolation of pluripotent equine embryonic stem (ES) cells, to date there are few reports about successful isolation of ESCs and no report of in vivo differentiation of this important companion species. We report the induction of pluripotency in adult equine fibroblasts via retroviral transduction with three transcription factors using OCT4, SOX2, and KLF4 in the ab...

متن کامل

Stabilization of Max-Min Fair Networks without Per-flow State

Let a flow be a sequence of packets sent from a source computer to a destination computer. Routers at the core of the Internet do not maintain any information about the flows that traverse them. This has allowed for great speeds at the routers, at the expense of providing only best-effort service. In this paper, we consider the problem of fairly allocating bandwidth to each flow. We assume some...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cell Stem Cell

سال: 2011

ISSN: 1934-5909

DOI: 10.1016/j.stem.2011.06.010